Disjoint cycles of order at least 5
نویسنده
چکیده
We prove that if G is a graph of order at least 5k with k ≥ 2 and the minimum degree of G is at least 3k then G contains k disjoint cycles of length at least 5. This supports the conjecture by Wang [Australas. J. Combin. 54 (2012), 59–84]: if G is a graph of order at least (2d+1)k and the minimum degree of G is at least (d+1)k with k ≥ 2 then G contains k disjoint cycles of length at least 2d+ 1.
منابع مشابه
An extension of the Corrádi-Hajnal Theorem
Corrádi and Hajnal [Acta Math. Acad. Sci. Hungar. 14 (1963), 423–439] showed that if G is a graph of order at least 3k with minimum degree at least 2k then G contains k disjoint cycles. In this paper, we extend this result to disjoint cycles of length at least 4. We prove that if G is a graph of order at least 4k with k ≥ 2 and the minimum degree of G is at least 2k then with three easily recog...
متن کاملVertex disjoint cycles in a directed graph
Let D be a directed graph of order n 4 and minimum degree at least (3n 3)/2. Let n = nI + n2 where nl 2 and n2 2. Then D contains two vertex-disjoint directed cycles of nI and n2 respectively. The result is sharp if n ~ 6: we give counterexamples if the condition on the minimum degree is relaxed. 1 Introduction We discuss only finite simple graphs and strict and use standard terminology and not...
متن کاملDisjoint 5-cycles in a graph
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.
متن کاملDisjoint Chorded Cycles of the Same Length
Corrádi and Hajnal [1] showed that any graph of order at least 3k with minimum degree at least 2k contains k vertex-disjoint cycles. This minimum degree condition is sharp, because the complete bipartite graph K2k−1,n−2k+1 does not contain k vertex-disjoint cycles. About the existence of vertex-disjoint cycles of the same length, Thomassen [4] conjectured that the same minimum degree condition ...
متن کاملProof of the Erdos-Faudree Conjecture on Quadrilaterals
Let G be a graph. A set of graphs are said to be disjoint if no two of them have any common vertex. Corrádi and Hajnal [2] investigated the maximum number of disjoint cycles in a graph. They proved that if G is a graph of order at least 3k with minimum degree at least 2k, then G contains k disjoint cycles. In particular, when the order of G is exactly 3k, then G contains k disjoint triangles. E...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 71 شماره
صفحات -
تاریخ انتشار 2018